Binary Space Partitioning (BSP) Trees

A binary space partitioning (bsp) tree represents a recursive, hierarchical subdivision of d-dimensional space into convex subspaces. BSP trees provide a computational representation of space that provides both a search structure and a representation of geometry. Constructing a bsp tree consists of partitioning a subspace by means of a hyperplane, which intersects the interior of that subspace, into 2 half-spaces. Each half-space is partitioned by a recursive application of the method. A “hyperplane” in d-space is a d-1 dimensional object which can subdivide a space into two half-spaces. In 3-space this hyperplane is a plane. In 2-space the hyperplane is a line.